Define the function by for all . We will first show that is a bijection.
Assume that Then which implies Hence, is injective. Now, let . Since is even, for Now, and is surjective. Since is both injective and surjective, it is bijective.
Lastly, we have
Thus, and are isomorphic.
Q.E.D.